Contracting and Proving Classes with Models

نویسنده

  • Bernd Schoeller
چکیده

Functional specification and verification often requires specialized mathematicians to do the work. Software development and proving correctness are regarded as separate activities. We want developers to do the specification and verification. One of the promising approaches for letting developers create specifications is the “Design by Contract” methodology [7] as present in the Eiffel language [8]. Contracts document the developer’s intend during an early phase of development and make assumptions on the existing system explicit. They establish a functional specification without leaving the notation of the programming language. The goal of this thesis is to integrate formal methods and Design by Contract into a common proof technology that does not require developers to learn a new notation and at the same time improves the quality of the software by using fully automated proofs. We try to achieve this goal by reducing the conceptual gap between Eiffel and the prover through the use of models and model-based contracts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving the efficiency of pro-2-groups of fixed co-classes

Among the six classes of pro-2-groups of finite and fixed co-classes and trivial Schur Multiplicator which studied by Abdolzadeh and Eick in 2009, there are two classes $$S_5=langle a,bmid [b,a^2]=1, a^2=[b,a]^2, (b^2)^{[b,a]}b^2=1rangle$$ and $$S_6=langle a,t,bmid a^2=b^2,[b,a]^2=1, t^a=t^{-1}[b,a], b^t=abarangle$$that have been conjectured to have deficiency zero presentations. In this paper ...

متن کامل

توسعه روش SL با ترتیب KBO برای اثبات خودکار پایان‌پذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران

 The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...

متن کامل

New classes of Extereme Shock Models

 In industry or nature, ‎there are systems subjected to a secuence of shocks ocurring randomly in time‎. ‎these shocks are causing aging or failure of system‎. ‎According to the type of shocks‎, ‎shock models divided in two major groups‎, ‎Extreme Shock Models and Cumulative Shock Models‎. ‎In the extreme shock models just impact of last shock named fatal shock would be studied and in the cumul...

متن کامل

CAMAC: a context-aware mandatory access control model

Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments such as military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes and flexibility of access control mechanisms may be required especially in pervasive c...

متن کامل

Geometry and Dynamics of the Besicovitch and Weyl Spaces

We study the geometric properties of Cantor subshifts in the Besicovitch space, proving that sofic shifts occupy exactly the homotopy classes of simplicial complexes. In addition, we study canonical projections into subshifts, characterize the cellular automata that are contracting or isometric in the Besicovitch or Weyl spaces, study continuous functions that locally look like cellular automat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006